Research Statement Dominic Klyve
نویسنده
چکیده
My research concerns explicit inequalities in elementary number theory. Specifically, I am interested in the distribution of twin primes, along with theoretical and computational techniques for putting explicit bounds on classes numbers such as twin primes. One important method I use to examine the density of twins is to look for bounds on Brun’s Constant. 1. Motivation and Background Twin primes are pairs of primes of the form (p, p+ 2). A natural first question to ask is “How many twin primes are there?” This is a very elementary question, in that understanding it requires no mathematics than most students have learned by the eighth grade. It is this simplicity that makes the question so tantalizing, as answering it remains beyond the capabilities of modern mathematics. The Twin Prime Conjecture states that there are infinitely many primes. The Twin Prime Conjecture also has a strong version, which states not only that there are infinitely many twin primes, but also estimates the number of twin primes less than a given bound x. Let π2(x) represent the number of primes p ≤ x − 2 such that p+ 2 is also prime. Then we have the following. Conjecture 1. Let α be the twin prime constant,
منابع مشابه
On the Sum of Reciprocals of Amicable Numbers
Two numbers m and n are considered amicable if the sum of their proper divisors, s(n) and s(m), satisfy s(n) = m and s(m) = n. In 1981, Pomerance showed that the sum of the reciprocals of all such numbers, P , is a constant. We obtain both a lower and an upper bound on the value of P .
متن کاملComputing prime harmonic sums
We discuss a method for computing ∑ p≤x 1/p, using time about x2/3 and space about x1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function π(x), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses 4.
متن کاملGraeco-Latin Squares and a Mistaken Conjecture of Euler∗
Late in his long and productive career, Leonhard Euler published a hundred-page paper detailing the properties of a new mathematical structure: Graeco-Latin squares. In this paper, Euler claimed that a Graeco-Latin square of size n could never exist for any n of the form 4k+2, although he was not able to prove it. In the end, his difficulty was validated. Over a period of 200 years, more than t...
متن کاملAn Empirical Approach to the St. Petersburg Paradox
Probability is well known for its counter-intuitive ideas and results. During a recent History of Mathematics class, the first author of this note asked his students, including the second author, to read about one such idea commonly called the St. Petersburg Paradox. In this problem, a gambler is to play the following game against the house: Game 1. A gambler flips a fair, 2-sided coin. If she ...
متن کاملHIV Recombination and Pathogenesis – Biological and Epidemiological Implications
Nitin K. Saksena1, Katherine A. Lau2, Dominic E. Dwyer3 and Bin Wang1 1Retroviral Genetics Division, Centre for Virus Research, Westmead Millennium Institute, The University of Sydney, Sydney 2Perinatal Medicine Group, Kolling Institute of Medical Research, Royal North Shore Hospital, St Leonards, NSW, Sydney 3Department of Virology, Institute for Clinical Pathology and Medical Research, Sydney...
متن کامل